| AbstractGraph |
Abstract implementation of the Graph interface.
|
| AbstractTypedGraph |
An abstract class for graphs whose edges all have the same EdgeType.
|
| BetweennessCentrality.BetweennessData |
|
| CommonMatcher |
The subset of the Matcher API which is used by this
package, and also shared with the re2j library.
|
| CommonPattern |
The subset of the Pattern API which is used by this
package, and also shared with the re2j library.
|
| EdgeScorer |
An interface for algorithms that assign scores to edges.
|
| EdgeType |
Defines the possible edge types for graphs which assign types to edges.
|
| Function |
|
| Functions.IdentityFunction |
|
| Functions.ToStringFunction |
|
| Graph |
A graph consisting of a set of vertices of type V
set and a set of edges of type E.
|
| Hypergraph |
A hypergraph, consisting of a set of vertices of type V
and a set of hyperedges of type E which connect the vertices.
|
| Pair |
An implementation of Collection that stores exactly
2 non-null objects and is not mutable.
|
| Predicate |
|
| Predicates.ObjectPredicate |
|
| UndirectedGraph |
A tagging interface for extensions of Graph that
accept only undirected edges.
|
| VertexScorer |
An interface for algorithms that assign scores to vertices.
|